Compositional Verification of Liveness Property in Inhibitor-arc Connections of Petri Net Systems

نویسنده

  • Fei Pu
چکیده

Petri net systems synthesis can construct large systems without the requirement of reachability analysis so that it can reduce the high complexity of analyzing global system. In a synthesis process, such good properties of subsystems as liveness and deadlock-freeness etc, must be preserved in synthesized system. This paper focusses on liveness preservation in inhibitor-arc connection operations. The systems dynamic, concurrent behavior relation i.e. concurrent language relation in inhibitor-arc connections is stressed studied. The corresponding language relation formula is present and proved, and it can be applied to determine liveness of synthesized system in inhibitorarc connection operations. Furthermore, some criteria are introduced, which are necessary and sufficient for liveness, to determine the liveness of global system by the same ones of local systems. Finally, some examples are given, illustrating the effectiveness of the proposed approach in modeling and analyzing of large systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Verification of Liveness Properties on Closed Timed-Arc Petri Nets

Verification of closed timed models by explicit state-space exploration methods is an alternative to the wide-spread symbolic techniques based on difference bound matrices (DBMs). A few experiments found in the literature confirm that for the reachability analysis of timed automata explicit techniques can compete with DBM-based algorithms, at least for situations where the constants used in the...

متن کامل

Compositional analysis for regularity, liveness and boundedness

By the linear algebraic representation of Petri nets, Desel introduced regularity property (Desel, 1992). Regularity implies a sufficient condition for a Petri net to be live and bounded. All the conditions checking the regularity of a Petri net are decidable in polynomial time in the size of a net (Desel and Esparza, 1995). This paper proves that regularity, liveness and boundedness can be pre...

متن کامل

Towards Compositional Verification of SDL Systems

In this paper, a new method for proving qualitative properties of SDL-systems is presented, which is based on a compositional high-level Petri net semantics for SDL. Since emphasis is laid on the modelling of dynamic creation and termination of processes and of procedures, our method is especially interesting for typical client-server systems. By using M-nets as the semantic model we are able t...

متن کامل

NPNtool: Modelling and Analysis Toolset for Nested Petri Nets

Nested Petri nets is an extension of Petri net formalism with net tokens for modelling multi-agent distributed systems with complex structure. While having a number of interesting properties, NP-nets have been lacking tool support. In this paper we present the NPNtool toolset for NP-nets which can be used to edit NP-nets models and check liveness in a compositional way. An algorithm to check m-...

متن کامل

Modular Reversibility Analysis in Self-loops Connections of Petri Net Systems

It is well known that the use of a modular approach for modeling has many advantages: it allows the modeler to consider different parts of the model independently of one another. A modular approach to analysis is also attractive: it often dramatically decreases the complexity of the analysis task. To create Petri net models of large systems, four bottom-up techniques, consisting of sharing oper...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • JSW

دوره 7  شماره 

صفحات  -

تاریخ انتشار 2012